- generic relation
- 1) Техника: общее отношение (в базах данных)2) Вычислительная техника: родовое отношение
Универсальный англо-русский словарь. Академик.ру. 2011.
Универсальный англо-русский словарь. Академик.ру. 2011.
Generic data model — Generic data models are generalizations of conventional data models. They define standardised general relation types, together with the kinds of things that may be related by such a relation type. Overview The definition of generic data model is… … Wikipedia
Relation algebra — is different from relational algebra, a framework developed by Edgar Codd in 1970 for relational databases. In mathematics, a relation algebra is a residuated Boolean algebra supporting an involutary unary operation called converse. The… … Wikipedia
Generic views — The principal of generic views in the study of cognition stipulates that the interpretation made by an observer of a distal phenomenon should be such as to not require that the observer be in a special position to, or relationship with, the… … Wikipedia
List of generic forms in British place names — The study of place names is called toponymy; for a more detailed examination of this subject in relation to British place names, please refer to British toponymy. This article lists a number of common generic forms found in British place names,… … Wikipedia
Porter's generic strategies — UK US noun [plural] ► MANAGEMENT, MARKETING the theory, developed by Michael Porter, that a business can get an advantage over other similar businesses in three ways, by cost leadership (= being a low cost producer), by differentiation (=… … Financial and business terms
Trademark distinctiveness — is an important concept in the law governing trademarks and service marks. A trademark may be eligible for registration, or registrable, if amongst other things it performs the essential trademark function, and has distinctive character.… … Wikipedia
Forcing (mathematics) — For the use of forcing in recursion theory, see Forcing (recursion theory). In the mathematical discipline of set theory, forcing is a technique invented by Paul Cohen for proving consistency and independence results. It was first used, in 1963,… … Wikipedia
Boolean-valued model — In mathematical logic, a Boolean valued model is a generalization of the ordinary Tarskian notion of structure or model, in which the truth values of propositions are not limited to true and false , but take values in some fixed complete Boolean… … Wikipedia
Master theorem — For a result in enumerative combinatorics, see MacMahon Master theorem. In the analysis of algorithms, the master theorem provides a cookbook solution in asymptotic terms (using Big O notation) for recurrence relations of types that occur in the… … Wikipedia
Info-gap decision theory — is a non probabilistic decision theory that seeks to optimize robustness to failure – or opportuneness for windfall – under severe uncertainty,[1][2] in particular applying sensitivity analysis of the stability radius type[3] to perturbations in… … Wikipedia
Data modeling — The data modeling process. The figure illustrates the way data models are developed and used today. A conceptual data model is developed based on the data requirements for the application that is being developed, perhaps in the context of an… … Wikipedia